Unique mapper tool for excluding regions without one-to-one mapping between a set of two reference genomes

ABSTRACT

A first reference genome is segmented into a plurality of bins and high-quality sequenced reads are mapped on a bin-by-bin basis to the plurality of bins in the first reference genome, and a second reference genome is segmented into a plurality of bins and high-quality sequenced reads are mapped on a bin-by-bin basis to the plurality of bins in the second reference genome. A best-mapped bin is identified in the second reference genome based on the greatest degree of match between the best-mapped bin in the second reference genome and a corresponding bin in the first reference genome.

PRIORITY APPLICATIONS

This application claims the benefit of and priority to the following:

U.S. Provisional Patent Application No. 63/294,813, titled “PERIODIC MASK PATTERN FOR REVELATION LANGUAGE MODELS,” filed Dec. 29, 2021 (Attorney Docket No. ILLM 1063-1/IP-2296-PRV);

U.S. Provisional Patent Application No. 63/294,816, titled “CLASSIFYING MILLIONS OF VARIANTS OF UNCERTAIN SIGNIFICANCE USING PRIMATE SEQUENCING AND DEEP LEARNING,” filed Dec. 29, 2021 (Attorney Docket No. ILLM 1064-1/IP-2297-PRV);

U.S. Provisional Patent Application No. 63/294,820, titled “IDENTIFYING GENES WITH DIFFERENTIAL SELECTIVE CONSTRAINT BETWEEN HUMANS AND NON-HUMAN PRIMATES,” filed Dec. 29, 2021 (Attorney Docket No. ILLM 1065-1/IP-2298-PRV);

U.S. Provisional Patent Application No. 63/294,827, titled “DEEP LEARNING NETWORK FOR EVOLUTIONARY CONSERVATION,” filed Dec. 29, 2021 (Attorney Docket No. ILLM 1066-1/IP-2299-PRV);

U.S. Provisional Patent Application No. 63/294,828, titled “INTER-MODEL PREDICTION SCORE RECALIBRATION,” filed Dec. 29, 2021 (Attorney Docket No. ILLM 1067-1/IP-2301-PRV); and

U.S. Provisional Patent Application No. 63/294,830, titled “SPECIES-DIFFERENTIABLE EVOLUTIONARY PROFILES,” filed Dec. 29, 2021 (Attorney Docket No. ILLM 1068-1/IP-2302-PRV).

The priority applications are incorporated by reference as if fully set forth herein.

FIELD OF THE TECHNOLOGY DISCLOSED

The technology disclosed relates to artificial intelligence type computers and digital data processing systems and corresponding data processing methods and products for emulation of intelligence (i.e., knowledge based systems, reasoning systems, and knowledge acquisition systems); and including systems for reasoning with uncertainty (e.g., fuzzy logic systems), adaptive systems, machine learning systems, and artificial neural networks. In particular, the technology disclosed relates to using deep convolutional neural networks to analyze ordered data.

RELATED APPLICATIONS

This application is related to US Nonprovisional Patent Application titled “VARIANT CALLING WITHOUT A TARGET REFERENCE GENOME” (Attorney Docket No. ILLM 1064-2/IP-2297-US1), filed contemporaneously. The related application is hereby incorporated by reference for all purposes.

This application is related to US Nonprovisional Patent Application titled “QUALITY DETECTION OF VARIANT CALLING USING A MACHINE LEARNING CLASSIFIER” (Attorney Docket No. ILLM 1064-3/IP-2297-US2), filed contemporaneously. The related application is hereby incorporated by reference for all purposes.

INCORPORATIONS

The following are incorporated by reference for all purposes as if fully set forth herein, and should be considered part of, this provisional patent filing:

Sundaram, L. et al. Predicting the clinical impact of human mutation with deep neural networks. Nat. Genet. 50, 1161-1170 (2018);

Jaganathan, K. et al. Predicting splicing from primary sequence with deep learning. Cell 176, 535-548 (2019);

U.S. Patent Application No. 62/573,144, titled “TRAINING A DEEP PATHOGENICITY CLASSIFIER USING LARGE-SCALE BENIGN TRAINING DATA,” filed Oct. 16, 2017 (Attorney Docket No. ILLM 1000-1/IP-1611-PRV);

U.S. Patent Application No. 62/573,149, titled “PATHOGENICITY CLASSIFIER BASED ON DEEP CONVOLUTIONAL NEURAL NETWORKS (CNNs),” filed Oct. 16, 2017 (Attorney Docket No. ILLM 1000-2/IP-1612-PRV);

U.S. Patent Application No. 62/573,153, titled “DEEP SEMI-SUPERVISED LEARNING THAT GENERATES LARGE-SCALE PATHOGENIC TRAINING DATA,” filed Oct. 16, 2017 (Attorney Docket No. ILLM 1000-3/IP-1613-PRV);

U.S. Patent Application No. 62/582,898, titled “PATHOGENICITY CLASSIFICATION OF GENOMIC DATA USING DEEP CONVOLUTIONAL NEURAL NETWORKS (CNNs),” filed Nov. 7, 2017 (Attorney Docket No. ILLM 1000-4/IP-1618-PRV);

U.S. patent application Ser. No. 16/160,903, titled “DEEP LEARNING-BASED TECHNIQUES FOR TRAINING DEEP CONVOLUTIONAL NEURAL NETWORKS,” filed on Oct. 15, 2018 (Attorney Docket No. ILLM 1000-5/IP-1611-US);

U.S. patent application Ser. No. 16/160,986, titled “DEEP CONVOLUTIONAL NEURAL NETWORKS FOR VARIANT CLASSIFICATION,” filed on Oct. 15, 2018 (Attorney Docket No. ILLM 1000-6/IP-1612-US);

U.S. patent application Ser. No. 16/160,968, titled “SEMI-SUPERVISED LEARNING FOR TRAINING AN ENSEMBLE OF DEEP CONVOLUTIONAL NEURAL NETWORKS,” filed on Oct. 15, 2018 (Attorney Docket No. ILLM 1000-7/IP-1613-US);

U.S. patent application Ser. No. 16/160,978, titled “DEEP LEARNING-BASED SPLICE SITE CLASSIFICATION,” filed on Oct. 15, 2018 (Attorney Docket No. ILLM 1001-4/IP-1680-US);

U.S. patent application Ser. No. 16/407,149, titled “DEEP LEARNING-BASED TECHNIQUES FOR PRE-TRAINING DEEP CONVOLUTIONAL NEURAL NETWORKS,” filed May 8, 2019 (Attorney Docket No. ILLM 1010-1/IP-1734-US);

U.S. patent application Ser. No. 17/232,056, titled “DEEP CONVOLUTIONAL NEURAL NETWORKS TO PREDICT VARIANT PATHOGENICITY USING THREE-DIMENSIONAL (3D) PROTEIN STRUCTURES,” filed on Apr. 15, 2021, (Atty. Docket No. ILLM 1037-2/IP-2051-US);

U.S. Patent Application No. 63/175,495, titled “MULTI-CHANNEL PROTEIN VOXELIZATION TO PREDICT VARIANT PATHOGENICITY USING DEEP CONVOLUTIONAL NEURAL NETWORKS,” filed on Apr. 15, 2021, (Atty. Docket No. ILLM 1047-1/IP-2142-PRV);

U.S. Patent Application No. 63/175,767, titled “EFFICIENT VOXELIZATION FOR DEEP LEARNING,” filed on Apr. 16, 2021, (Atty. Docket No. ILLM 1048-1/IP-2143-PRV);

U.S. patent application Ser. No. 17/468,411, titled “ARTIFICIAL INTELLIGENCE-BASED ANALYSIS OF PROTEIN THREE-DIMENSIONAL (3D) STRUCTURES,” filed on Sep. 7, 2021, (Atty. Docket No. ILLM 1037-3/IP-2051A-US);

U.S. Provisional Patent Application No. 63/253,122, titled “PROTEIN STRUCTURE-BASED PROTEIN LANGUAGE MODELS,” filed Oct. 6, 2021 (Attorney Docket No. ILLM 1050-1/IP-2164-PRV);

U.S. Provisional Patent Application No. 63/281,579, titled “PREDICTING VARIANT PATHOGENICITY FROM EVOLUTIONARY CONSERVATION USING THREE-DIMENSIONAL (3D) PROTEIN STRUCTURE VOXELS,” filed Nov. 19, 2021 (Attorney Docket No. ILLM 1060-1/IP-2270-PRV); and

U.S. Provisional Patent Application No. 63/281,592, titled “COMBINED AND TRANSFER LEARNING OF A VARIANT PATHOGENICITY PREDICTOR USING GAPED AND NON-GAPED PROTEIN SAMPLES,” filed Nov. 19, 2021 (Attorney Docket No. ILLM 1061-1/IP-2271-PRV).

BACKGROUND

The subject matter discussed in this section should not be assumed to be prior art merely as a result of its mention in this section. Similarly, a problem mentioned in this section or associated with the subject matter provided as background should not be assumed to have been previously recognized in the prior art. The subject matter in this section merely represents different approaches, which in and of themselves can also correspond to implementations of the claimed technology.

The explosion of available biological sequence data has led to multiple computational approaches that infer the proteins' three-dimensional structure, biological function, fitness, and evolutionary history from sequence data. So-called protein language models, like the ones based on the Transformer architecture, have been trained on large ensembles of protein sequences by using the masked language modeling objective of filling in masked amino acids in a sequence, given the surrounding ones.

Protein language models capture long-range dependencies, learn rich representations of protein sequences, and can be employed for multiple tasks. For example, protein language models can predict structural contacts from single sequences in an unsupervised way.

Protein sequences can be classified into families of homologous proteins that descend from an ancestral protein and share a similar structure and function. Analyzing multiple sequence alignments (MSAs) of homologous proteins provides important information about functional and structural constraints. The statistics of MSA columns, which represent amino-acid sites, identify functional residues that are conserved during evolution. Correlations of amino acid usage between the MSA columns contain important information about functional sectors and structural contacts.

Language models were initially developed for natural language processing and operate on a simple but powerful principle: they acquire linguistic understanding by learning to fill in missing words in a sentence, akin to a sentence completion task in standardized tests. Language models develop powerful reasoning capabilities by applying this principle across large text corpora. The Bidirectional Encoder Representations from Transformers (BERT) mode instantiated this principle using Transformers, a class of neural networks in which attention is the primary component of the learning system. In a Transformer, each token in the input sentence can “attend” to all other tokens by exchanging activation patterns corresponding to the intermediate outputs of neurons in a neural network.

Protein language models like the MSA Transformer have been trained to perform inference from MSAs of evolutionarily related sequences. The MSA Transformer interleaves per-sequence (“row”) attention with per-site (“column”) attention to incorporate coevolution. Combinations of row attention heads in the MSA Transformer have led to state-of-the-art unsupervised structural contact predictions.

End-to-end deep learning approaches for variant effect predictions are applied to predict the pathogenicity of missense variants from protein sequence and sequence conservation data (See Sundaram, L. et al. Predicting the clinical impact of human mutation with deep neural networks. Nat. Genet. 50, 1161-1170 (2018), referred to herein as “PrimateAI”). PrimateAI uses deep neural networks trained on variants of known pathogenicity with data augmentation using cross-species information. PrimateAI in particular uses sequences of wild-type and mutant proteins to compare the difference and decide the pathogenicity of mutations using the trained deep neural networks. Such an approach that utilizes the protein sequences for pathogenicity prediction is promising because it can avoid the problem of circularity and overfitting to previous knowledge. However, compared to the adequate number of data to train the deep neural networks effectively, the number of clinical data available in ClinVar is relatively small. To overcome this data scarcity, PrimateAI uses common human variants and variants from primates as benign data while simulated variants based on trinucleotide context were used as unlabeled data.

PrimateAI outperforms prior methods when trained directly upon sequence alignments. PrimateAI learns important protein domains, conserved amino acid positions, and sequence dependencies directly from the training data consisting of about 120,000 human samples. PrimateAI substantially exceeds the performance of other variant pathogenicity prediction tools in differentiating benign and pathogenic de-novo mutations in candidate developmental disorder genes, and in reproducing prior knowledge in ClinVar. These results suggest that PrimateAI is an important step forward for variant classification tools that may lessen the reliance of clinical reporting on prior knowledge.

Therefore, an opportunity arises to use protein language models and MSAs for variant pathogenicity prediction. More accurate variant pathogenicity prediction may result.

BRIEF DESCRIPTION OF THE DRAWINGS

The patent or application file contains at least one drawing executed in color. Copies of this patent or patent application publication with color drawing(s) will be provided by the Office upon request and payment of the necessary fee. The color drawings also may be available in PAIR via the Supplemental Content tab.

In the drawings, like reference characters generally refer to like parts throughout the different views. Also, the drawings are not necessarily to scale, with an emphasis instead generally being placed upon illustrating the principles of the technology disclosed. In the following description, various implementations of the technology disclosed are described with reference to the following drawings, in which.

FIG. 1 is a flow diagram that illustrates a process of a system for variant calling for a particular Target Species 120 without using the target reference genome.

FIG. 2 is a sequential flow diagram representing the process of identifying false positive variants by means of a set comparison for identification of true positive variants from sequenced reads.

FIG. 3 illustrates an example of genetic variants from an example reference genetic sequence A with two example variant sequences in which the variant sequences possess a respective single nucleotide variant in a single base position but otherwise possess an identical composition to the reference sequence.

FIG. 4 graphically represents the process of base-resolution variant calling sensitivity detection in a series of example flow diagrams mapping sequenced reads to reference genomes.

FIG. 5 is a schematic illustrating the process of mapping sequenced reads to a reference genome.

FIG. 6 represents a graphical flow diagram of a process for alternative detection of the second variant set in one implementation of the technology disclosed where a target species reference genome is available.

FIG. 7 is a schematic illustrating the evolutionary relationship between the target species and the pseudo-target species using simplified phylogenic tree graphics.

FIG. 8 is a schematic illustrating the evolutionary relationship between the target species and the pseudo-target species using a simplified phylogenic tree graphic.

FIG. 9 is a schematic representing genome-resolution variant calling sensitivity detection of sequenced reads.

FIG. 10 is a schematic flow diagram demonstrating how the output data generated by the set comparison of sequenced reads mapped to a non-target reference genome and a pseudo-target reference genome can be used as a training dataset for a quality classifier to predict variant quality where a reference genome is not available, in contrast to methods wherein the quality is determined by mapping to non-target or pseudo-target genomes.

FIG. 11 is an illustrative example of the variant features in the plurality of variant features describing guanine-cytosine content.

FIG. 12 is an illustrative example of the variant feature in the plurality of variant features describing local composition complexity.

FIG. 13 is an illustrative example of the variant feature in the plurality of variant features describing allelic count.

FIG. 14 is an illustrative example of the variant feature in the plurality of variant features describing process of mapping sequenced reads to a reference genome wherein an additional step is added to compute a quality metric of the mapping.

FIG. 15 is an illustrative example of the variant feature in the plurality of variant features describing strand bias in sequenced reads when mapped to a reference genome.

FIG. 16 is an illustrative example of the variant features in the plurality of variant features describing the depth and coverage of sequenced reads mapped to a reference genome.

FIG. 17 is an illustrated flow diagram representing the variant quality classifier configured as a random forest model to classify a target variant as either belonging to the high quality class or the low quality class.

FIG. 18 is an illustrated flow diagram representing the variant quality classifier configured as a logistic regression model to classify a target variant as either belonging to the high quality class or the low quality class.

FIG. 19 is an illustrated flow diagram representing the variant quality classifier configured as a neural network model to classify a target variant as either belonging to the high quality class or the low quality class.

FIG. 20 is a flow diagram of the unique mapper overview process to further improve the quality of a set of called variants following variant calling or machine learning variant classification.

FIG. 21 schematically illustrates the gene annotation filter in the series of cascaded filters for variant quality filtering.

FIG. 22 schematically illustrates the process codon transcription and translation and filtering for codon match.

FIG. 23 illustrates the process of filtering genes based on a distribution of machine learning scores.

FIG. 24 illustrates deviation from Hardy-Weinberg Equilibrium in an example population.

FIG. 25 is an illustration of a nonsense variant.

FIG. 26 contains a graph of collected results demonstrating the cascading filter effect on the number of nonsense variants per sample.

FIG. 27 contains a graph of collected results demonstrating the cascading filter effect on missense: synonymous ratio of called variants per sample.

FIG. 28 contains a graph of collected results demonstrating the cascading filter effect on number of insertion-deletion variants (indels) per sample.

FIG. 29 shows an example computer system that can be used to implement the technology disclosed.

DETAILED DESCRIPTION

The following discussion is presented to enable any person skilled in the art to make and use the technology disclosed and is provided in the context of a particular application and its requirements. Various modifications to the disclosed implementations will be readily apparent to those skilled in the art, and the general principles defined herein may be applied to other implementations and applications without departing from the spirit and scope of the technology disclosed. Thus, the technology disclosed is not intended to be limited to the implementations shown but is to be accorded the widest scope consistent with the principles and features disclosed herein.

The detailed description of various implementations will be better understood when read in conjunction with the appended drawings. To the extent that the figures illustrate diagrams of the functional blocks of the various implementations, the functional blocks are not necessarily indicative of the division between hardware circuitry. Thus, for example, one or more of the functional blocks (e.g., modules, processors, or memories) may be implemented in a single piece of hardware (e.g., a general purpose signal processor or a block of random access memory, hard disk, or the like) or multiple pieces of hardware. Similarly, the programs may be stand-alone programs, may be incorporated as subroutines in an operating system, may be functions in an installed software package, and the like. It should be understood that the various implementations are not limited to the arrangements and instrumentality shown in the drawings.

The processing engines and databases of the figures, designated as modules, can be implemented in hardware or software, and need not be divided up in precisely the same blocks as shown in the figures. Some of the modules can also be implemented on different processors, computers, or servers, or spread among a number of different processors, computers, or servers. In addition, it will be appreciated that some of the modules can be combined, operated in parallel or in a different sequence than that shown in the figures without affecting the functions achieved. The modules in the figures can also be thought of as flowchart steps in a method. A module also need not necessarily have all its code disposed contiguously in memory; some parts of the code can be separated from other parts of the code with code from other modules or other functions disposed in between.

The technologies disclosed can be used to improve the quality of pathogenic variant calling. The technology disclosed can be used to improve the quality of variant calling in scenarios where desired reference genomes are unavailable. There are 8.7 million species worldwide, but very few have reference genome builds. In many scenarios, we need to do variant calling in the absence of reference genome builds. In some instances, we could choose a closely-related species as a reference genome for variant calling. But this, sometimes, leads to many false positive calls. Thus, we developed various methods to reduce the false positives, including the random forest classifiers, linear regression models, and neural network models. We also devised a unique-mapper score to identify regions that are not one-to-one mapping between the species, which will further reduce variant calling errors.

Variant Calling Using a Non-Target Reference Genome

FIG. 1 is a flow diagram that illustrates a process 100 of a system for variant calling for a particular Target Species 120 without using the target reference genome. Mapping sequenced reads from a Target Species 120 to a Non-Target Reference Genome 102 detects a First Set of Variants in the Sequenced Reads of the Target Species 104. The Non-Target Reference Genome 102 is from a non-target species other than the Target Species 120. In some implementations of the technology disclosed, the Non-Target Reference Genome 102 is non-homologous with the genome of Target Species 120, as determined by a homology threshold (such as a percentage homology below 30%, 40%, or 50%, or a double-bounded range of acceptable homology percentages such as 30-40% or 40-50%). In certain embodiments, the non-target species and Target Species 120 belong to the same taxonomical genus, family, order, or class.

Mapping sequenced reads from a Target Species 120 to a Pseudo-Target Reference Genome 142 detects a Second Set of Variants in the Sequenced Reads of the Target Species 144. The Pseudo-Target Reference Genome 142 is from a pseudo-target species other than the Target Species 120. In some implementations of the technology disclosed, the Pseudo-Target Reference Genome 142 is homologous with the genome of Target Species 120, as determined by a homology threshold (such as a percentage homology above 80%, 90%, or 95%, or a double-bounded range of acceptable homology percentages such as 85-90% or 80-89%). A homology threshold set to determine degree of homology between the pseudo-target species and target species may be the same as a homology threshold set to determine degree of homology between the non-target species and target species, or the respective homology thresholds may differ. In some embodiments, the homology threshold set to determine degree of homology between the non-target species and target species may be informed by the degree of homology between the pseudo-target species and target species, or vice versa. The Comparison 126 of the first set of variants and second set of variants identifies a subset of False Positive Variants 128 (i.e., overlapping variants identified by mapping to the Pseudo-Target Reference Genome 142 cannot be considered as reliable positive variants on the basis of homology when the variants are also identified by mapping to Non-Target Reference Genome 102).

FIG. 2 is a sequential flow diagram 200 representing the process of identifying false positive variants by means of a set comparison for identification of true positive variants from sequenced reads. Mapping sequenced reads from a Target Species 202 to a Non-Target Species Reference Genome 204 detects a First Set of Variants 223. Mapping sequenced reads from a Target Species 206 to a Pseudo-Target Species Reference Genome 208 detects a Second Set of Variants 227. A Venn diagram represents the union Variant Set 1∪Variant Set 2, wherein the set difference Variant Set 1-Variant Set 2 is represented by the left downward diagonal shaded area 244 and the set difference Variant Set 2-Variant Set 1 is represented by the right upward diagonal shaded area 246. The intersection Variant Set 1 n Variant Set 2 is represented by the center diamond crosshatch shaded area 266. The intersection Variant Set 1 n Variant Set 2 (i.e., called variants identified both in the first set of variants 223 detected by mapping to a Non-Target Reference Genome 204 and the Second Set of Variants 227 detected by mapping to a Pseudo-Target Reference Genome 208) translates to the set of True Positive Variants 266. The set difference Variant Set 2-Variant Set 1 (i.e., called variants identified in the Second Set of Variants 227 detected by mapping to a Pseudo-Target Reference Genome 208 but not identified in the First Set of Variants 223 detected by mapping to a Non-Target Reference Genome 204) translates to the Set of False Positive Variants 268.

FIG. 3 illustrates an example of Genetic Variants 300 from an example Reference Genetic Sequence A 302 with two example Variant Sequences 1A 322 and 1B 342 in which the variant sequences possess a respective single nucleotide variant in a single base position but otherwise possess an identical composition to the reference sequence. For example, a single nucleotide substitution is shown as Adenine 326 in Variant 1A 322 and Thymine 336 in Variant 1B 342 as compared to Cytosine 306 in the Reference Genetic Sequence A 302.

FIG. 4 graphically represents the process 400 of base-resolution variant calling sensitivity detection in a series of example flow diagrams mapping sequenced reads to reference genomes. Sequenced Read X 410 is mapped to Pseudo-Target Reference Genome 402 and will be called as a variant due to the A4C single nucleotide variant in position 5. Sequenced Read X 410 is also mapped to Non-Target Reference Genome 404 and will not be called as a variant as a single nucleotide variant is not identified. As a result, Sequenced Read X 410 belongs to the set difference between the called variant set from mapping to the Pseudo-Target Reference Genome 402 and the variant set from mapping to the Non-Target Reference Genome 404 therefore Sequenced Read X 410 is a false positive. Sequenced Read Y 412 is mapped to Pseudo-Target Reference Genome 422 and will be called as a variant due to the A4C single nucleotide variant in position 5. Sequenced Read Y 412 is also mapped to Non-Target Reference Genome 424 and will be called as a variant due to the A4C single nucleotide variant in position 5. As a result, Sequenced Read Y 412 belongs to the set intersection between the called variant set from mapping to the Pseudo-Target Reference Genome 422 and the variant set from mapping to the Non-Target Reference Genome 424 therefore Sequenced Read Y 412 is a true positive.

Sequenced Read Z is mapped to Pseudo-Target Reference Genome 442 and will not be called as a variant despite the cytosine and guanine not being equivalent at position five. Due to base pairing, the complementary strand of the Pseudo-Target Reference Genome 442 possesses a cytosine at position 5 and the complementary strand of the Sequenced Read Z 414 possesses a guanine at position 5. As a result, this Sequenced Read Z 414 is not a variant when mapped to Pseudo-Target Reference Genome 442. Sequenced Read Z 414 is also mapped to Non-Target Reference Genome 444 and will not be called as a variant due to complementary bases being present at position 5. As a result, Sequenced Read Z 414 belongs to the complement of both the called variant set from mapping to the Pseudo-Target Reference Genome 442 and the called variant set from the Non-Target Reference Genome 444 therefore Sequenced Read Z 414 is a true negative variant.

FIG. 5 is a schematic 500 illustrating the process of mapping sequenced reads to a Reference Genome. Sequenced Reads 502 are mapped to Reference Genome 505 resulting in Mapping 555. In Mapping 555, each sequenced read from the set of Sequenced Reads 502 aligns with a given genomic region within the Reference Genome 505. As seen in Mapping 555, mapped sequenced reads may align with genomic regions that are mutually exclusive (i.e., do not overlap, such as the leftmost sequenced read and the middle sequenced read in Mapping 555) or are not mutually exclusive from each other (i.e., do overlap, such as the middle sequenced read and the rightmost sequenced read in Mapping 555).

FIG. 6 represents a graphical flow diagram 600 of a process for alternative detection of Variant Set Two in one implementation of the technology disclosed where a Target Species Reference Genome 622 is available. Sequenced Reads from A Target Species 602 are mapped to the Target Species Reference Genome 622. The mapped sequence reads of the target species are lifted over to a Reference Genome Of A Non-Target Species 642. Variants that are detected in the Non-Target Species Reference Genome 642 but not detected in the Target Species Reference Genome 622 comprise Variant Set Two 662 wherein the plurality of variants in Variant Set Two 662 are false positive variants. The alternative detection of Variant Set Two 662 is useful in generating training data comprising known ground truth data to be used in training a machine learning classifier for the detection of true positive variants and false positive variants.

FIG. 7 is a schematic 700 illustrating the evolutionary relationship between the target species and the pseudo-target species using simplified phylogenic tree graphics. In Phylogenic Tree A 702, the pseudo-target species and the target species are different species that are not orthologous. In one implementation of the technology disclosed, the evolutionary relationship between the target species and the pseudo-target species is reflective of that shown in Phylogenic Tree A 702. In Phylogenic Tree B 704, the pseudo-target species and the target species are different species that are orthologous. In one implementation of the technology disclosed, the evolutionary relationship between the target species and the pseudo-target species is reflective of that shown in Phylogenic Tree B 704. In Phylogenic Tree C 706, the pseudo-target species and the target species are the same species. In one implementation of the technology disclosed, the evolutionary relationship between the target species and the pseudo-target species is reflective of that shown in Phylogenic Tree C 706.

FIG. 8 is a schematic 800 illustrating the evolutionary relationship between the target species and the pseudo-target species using a simplified phylogenic tree graphic. In Phylogenic Tree D 802, the non-target species and the target species are different species wherein the non-target species is a human and the target species is a non-human primate. In one implementation of the technology disclosed, the evolutionary relationship between the target species and the non-target species reflects that of Phylogenic Tree D 802. In one implementation of the technology disclosed, primate species samples and reference genomes are leveraged to infer the pathogenicity of orthologous human variants by variant calling to closely-related primate species genomes, variant calling to non-target, non-homologous primate species genomes, and contrasting the results as demonstrated within FIGS. 1-5 . In some implementations of the technology disclosed, machine learning classifiers are trained to detect false positive variants, further refining the identification process of true positive variants.

FIG. 9 is a schematic 900 representing genome-resolution variant calling sensitivity detection of sequenced reads. Sequenced Read A from a Target Species 902 is equivalent to Sequenced Read A from a Target Species 942 and maps to Region One 922 in the Non-Target Reference Genome 924 and Region Two 962 in the Pseudo-Target Reference Genome 964. Region One 922 and Region Two 962 are not equivalent (i.e., not orthologous), therefore Sequenced Read A does not map to the same genomic region in the Non-Target Reference Genome 924 and in the Pseudo-Target Reference Genome 964. Despite mapping to both the Non-Target Reference Genome 924 and the Pseudo-Target Reference Genome 964, Sequenced Read A 902 does not result in a called variant in the genomic region within the Non-Target Reference Genome 964 that is orthologous to the genomic region that Sequenced Read A 942 maps to within the Pseudo-Target Reference Genome 964. As a result, this variant will belong to the called variant set from mapping to the Pseudo-Target Reference Genome 964 but will not belong to the called variant set from mapping to the Non-Target Reference Genome 924 and results in a false positive.

Sequenced Read B from a Target Species 982, Sequenced Read B from a Target Species 984, and Sequenced Read B from a Target Species 986 are equivalent. Region Three 984, Region Four 986, and Region Five 988 belong to the non-target reference genome and are not equivalent. Sequenced Read B 982 from the Target Species maps to multiple regions within the non-target reference genome. As with Sequenced Read A 902, Sequenced Read B 982 will map to a different genomic region within the non-target species reference genome than the orthologous genomic region that Sequenced Read B 982 maps to within the pseudo-target reference genome due to the multiplicity of variant calling within the non-target reference genome. Subsequently, sequenced read that maps to more than two genomic regions within the non-target reference genome will result in a false positive.

Machine Learning Classifiers

FIG. 10 is a schematic flow diagram 1000 demonstrating how the output data generated by the set comparison of sequenced reads mapped to a non-target reference genome and a pseudo-target reference genome can be used as a training dataset for a quality classifier to predict variant quality where a reference genome is not available, in contrast to methods wherein the quality is determined by mapping to non-target or pseudo-target genomes. Sequenced Reads from a Target Species 1002 are mapped to reference genomes as previously described in FIGS. 1, 2, and 3 . The intersection of Variant Set One 1004 and Variant Set Two 1006 corresponds to the Set of True Positive Variants 1022. The set difference between Variant Set Two 1006 and Variant Set One 1004 (i.e., present in Variant Set Two 1006 but not present in Variant Set One 1004) corresponds to the Set of False Positive Variants 1008. The Set of True Positive Variants 1022 is further coded as a Set of High Quality Variants 1024. The Set of False Positive Variants 1008 is further coded as a Set of Low Quality Variants 1010. The combined set of High Quality Variants 1024 and Low Quality Variants 1010 comprise the set of Ground Truth Data 1020.

The Quality Classifier 1064 undergoes a Model Training Process 1040 on the Ground Truth Data 1020. The Quality Classifier 1064 takes an Input Target Variant 1062 represented as a vector containing the set of variant features in the plurality of variant features {x₁:x_(n)} where each value of x is a variant feature within the set of variant features in the plurality of variant features describing the Target Variant 1062. In some implementations of the technology disclosed, additional variant features can be extracted from Variant Call Format (.vcf) files. The Quality Classifier 1064 is a binary classification model with output classes for High Quality 1066 and Low Quality 1068.

FIG. 11 is an illustrative example 1100 of the variant features in the plurality of variant features describing guanine-cytosine content. A short Genetic Sequence B 1102 contains a proportion of adenine, thymine, guanine, and cytosine nucleic acids. The guanine-cytosine content (GC) of a genetic sequence corresponds to the proportion of guanine and cytosine nucleic acids within the sequence. GC content is a physiochemical descriptor of nucleic acid sequences that can be used as a proxy for thermostability of nucleic acid sequences due to differences in chemical bonding behavior as compared to adenine-thymine bonding behavior. GC content influences read coverage in next-generation sequencing applications. Equation 1122 is used for a sample calculation for the GC content of Genetic Sequence B 1102 wherein GC content is equivalent to the ratio of guanine and cytosine count to the overall count of all nucleic acids. Equation 1124 is used for a sample calculation of genetic skew of Genetic Sequence B 1102 wherein GC skew is determined as the ratio of the difference between guanine count and cytosine count to the sum of guanine count and cytosine count for a given window size. The Window Size Example 1164 illustrates a window size of five. When the window size of five is applied to Genetic Sequence B 1102, GC skew is calculated as shown in Table 1184.

FIG. 12 is an illustrative example 1200 of the variant feature in the plurality of variant features describing local composition complexity. Local composition complexity is a measure of entropy within a genetic sequence. Genetic Sequence X 1202 contains no variability of nucleic acid composition and therefore has low entropy. Genetic Sequence Z 1242 has high variability of nucleic acid composition and therefore has high entropy. Genetic Sequence Y 1222 contains more variability than Genetic Sequence X 1202 but less than Genetic Sequence Z 1242 therefore it can be described as having a medium (i.e., moderate) level of entropy. Equation 1224 computes the entropy of a genetic sequence in the format of local composition complexity. A sample calculation for Genetic Sequence B 1204 results in an entropy value of 1.92 wherein entropy is equivalent to a sum of logarithmic probabilities scaled by the same respective probability for each nucleic acid.

FIG. 13 is an illustrative example 1300 of the variant feature in the plurality of variant features describing allelic count. Variant One 1302 is shown in shaded grey and Variant Two 1304 is shown in white. Population 1322 contains samples of numerous genetic sequences belonging to either Variant One 1302 or Variant Two 1304. Within Population 1322, there are six total samples belonging to Variant One 1302, thus the total allelic count of Variant One 1302 is six. Within Population 1322, there are nine total samples belonging to Variant Two 1304, thus the total allelic count of Variant One 1304 is nine. The error rate for detecting heterozygote called variants is higher than the comparable error rate of homozygous called variants (i.e., heterozygotic false positives occur at a higher rate than homozygotic false positives).

FIG. 14 is an illustrative example 1400 of the variant feature in the plurality of variant features describing process of mapping sequenced reads to a reference genome wherein an additional step is added to compute a quality metric of the mapping. Sequenced Reads 1402 are mapped to a Reference Genome 1404 to produce a Mapping 1444. Mapping quality scores quantify the likelihood of a misplaced sequenced read to the reference genome. Mapping quality is determined by total possible alignments for a given sequenced read and the count of mismatched base pairs within the alignment. The mapping quality score is reported on a Phred scale, a commonly used logarithmic data scaling technique for error rates in sequencing analysis.

FIG. 15 is an illustrative example 1500 of the variant feature in the plurality of variant features describing strand bias in sequenced reads when mapped to a reference genome. Sequenced Reads 1502 contain reads with different strand orientation (i.e., strands oriented in the 5′→3′ direction and strands oriented in the 3′→5′ direction). As Sequenced Reads 1502 are mapped to Reference Genome 1504, the Mapping 1544 generated will display sequencing biases based on strand orientation wherein one DNA strand is favored over the other. Strand bias may result in a higher error rate for allele count.

FIG. 16 is an illustrative example 1600 of the variant features in the plurality of variant features describing the depth and coverage of sequenced reads mapped to a reference genome. Depth and coverage of a particular mapping are measures of mapping quality, where both sequencing coverage and depth of sequencing coverage are proportional metrics to the quality of the particular mapping. A set of sequenced reads 1602 are mapped to a reference genome 1604 at the various genomic regions along the X-axis. The total percentage of target bases within the reference genome to which sequenced reads are mapped is quantified as the coverage of the genome. The average depth of sequencing coverage is the ratio of the number of reads scaled by read length to the total referenced genome length. This concept is illustrated by visualizing the X-axis as length of the reference genome 1604 with coverage corresponding to the total spread breadth of the aligned sequenced reads 1602, whereas the Y-axis shows visualizes the depth by which the reference genome 1604 is covered.

FIG. 17 is an illustrated flow diagram 1700 representing the variant quality classifier configured as a random forest model to classify a Target Variant 1762 as either belonging to the High Quality Class 1766 or the Low Quality Class 1768. The Quality Classifier 1744 takes an Input Target Variant 1762 represented as a vector containing the set of variant features in the plurality of variant features {x₁:x_(n)} where each value of x is a variant feature within the set of variant features in the plurality of variant features describing the Target Variant 1762 and generates a classification from Random Forest Model 1744. In the Random Forest Model 1744, a plurality of decision trees each generate a respective output result of the target variant class and a final result is generated via majority averaging.

FIG. 18 is an illustrated flow diagram 1800 representing the variant quality classifier configured as a logistic regression model to classify a Target Variant 1862 as either belonging to the High Quality Class 1866 or the Low Quality Class 1868. The Quality Classifier 1844 takes an Input Target Variant 1862 represented as a vector containing the set of variant features in the plurality of variant features {x₁:x_(n)} where each value of x is a variant feature within the set of variant features in the plurality of variant features describing the Target Variant 1862 and generates a classification from Logistic Regression Model 1844. In the Logistic Regression Model 1844, the model generates an output value in the range of {0,1} and a decision threshold boundary determines if an input value (i.e., target variant 1862) will be classified as an output of 0 or 1 (e.g., a decision threshold boundary of 0.5 leads to values in the range {0,0.4} generating an output of 0 and values in the range {0.5,1} generating an output of 1). Determination of the optimal decision threshold boundary may be determined on the basis of optimization of a particular performance metric when training the logistic regression model, such as accuracy, precision, recall, or a particular error function. The binary output values 0 and 1 are assigned to two output classes, High Quality 1866 or Low Quality 1868.

FIG. 19 is an illustrated flow diagram 1900 representing the variant quality classifier configured as a neural network to classify a Target Variant 1962 as either belonging to the High Quality Class 1966 or the Low Quality Class 1968. The Quality Classifier 1944 takes an Input Target Variant 1962 represented as a vector containing the set of variant features in the plurality of variant features {x₁:x_(n)} where each value of x is a variant feature within the set of variant features in the plurality of variant features describing the Target Variant 1962 and generates a classification from Neural Network 1944. The neural network model processes the Input Target Variant 1962 via a series of connected layers of nodes which each perform a respective weighted data transformation. Backpropagation through the network updates the weights of each node iteratively during the training process and the final trained model generates an output belonging to the High Quality Class 1966 or Low Quality Class 1968 for the Input Target Variant 1962. At this stage, variants identified as high quality or low quality undergo may further filtering steps in certain embodiments, as described further below.

Unique Mapper

FIG. 20 is a flow diagram 2000 of the unique mapper overview process to further improve the quality of a set of called variants following variant calling or machine learning variant classification. Sequenced Reads of a Sample of a Target Species 2002 undergo a filtering process via Cascading Filters 2004 to remove Low Quality Sequenced Reads 2024. The sequencing data may be obtained from Binary Alignment Map (.bam) files. The series of Cascading Filters 2004 comprise filters that remove variants with incorrect codon match between primates and humans, remove variants with annotation errors, gene-specific filters (e.g., skewed distribution of variant machine learning classifier quality scores compared with exomewide scores or deviations from the Hardy-Weinberg equilibrium), and removal of variants that do not meet a particular machine learning classifier performance metric threshold. The resulting Intermediate Set of Sequenced Reads 2006 is mapped to a Pseudo-Target Reference Genome 2008 and to a Non-Target Reference Genome 2026. The Pseudo-Target Reference Genome 2008 is divided into a number of bins (i.e., sequential nonoverlapping genomic regions of specified equal length). The Non-Target Reference Genome 2026 is also divided into an equivalent number of bins of equivalent size in comparison to the Pseudo-Target Reference Genome 2008 bins. Bins are compared on a one-to-one basis to determine the degree of mapping homology between corresponding bins. The best-mapped bin is identified as the bin wherein the degree of match (i.e., alignment between mapped genome for the bin) and used to generate a Unique Mapper Score 2040. In one embodiment of the technology disclosed, The Unique Mapper Score 2040 is unique for each specific sample, and the Unique Mapper Scores across all samples to a specific reference target species are averaged to obtain a single mean Unique Mapper Score which applies to all variants of the reference target species that fall into each respective bin.

FIG. 21 schematically illustrates the Gene Annotation Filter 2100 in the series of cascaded filters for variant quality filtering. Gene annotation includes the labeling of a genome for features such as gene location, coding and non-coding regions, and various descriptors of genetic function. Incorrect gene annotation can lead to error in the variant calling process. Gene A 2102 is located at a genomic region and includes Feature X at a specific location within its structure. Gene A 2104 is the correct gene annotation of Gene A 2102 wherein the genomic structure is correctly annotated with Feature X properly located. Gene B 2106 is in a different location and contains different structure (i.e., contains Feature Y rather than Feature X). In a case of incorrect gene annotation by gene prediction error, Gene A 2102 may be incorrectly annotated as Gene B 2106. As a result, any resulting mapping to Gene B 2106 (i.e., despite being labeled as Gene B, the genomic sequence belongs to Gene A) is erroneous. Called variants mapped to genes with annotation errors are filtered out.

FIG. 22 schematically illustrates the process 2200 codon transcription and translation and filtering for codon match. Genetic Sequence A 2202 consists of nucleic acids. The nucleic acid sequence in Genetic Sequence A 2202 undergoes transcription to generate mRNA Transcript A 2242. Following transcription, mRNA Transcript A 2242 is translated to generate Amino Acid Sequence A 2262. Each amino acid is translated from a three nucleic acid sequence referred to as a codon as highlighted by grey shaded boxes for five total codons across Genetic Sequence A 2202, mRNA Transcript A 2242, and Amino Acid Sequence A 2262. Codon B 2282 and Codon C 2284 contain identical nucleic acids and will therefore be transcribed and translated into the same amino acid. If a non-target reference genome contained Codon B 2282 and a pseudo-target reference genome contained Codon C 2284 at the same aligned position, these codons would match and the codon mismatch filter would not remove called variants that align to the genomic region corresponding to Codon B 2282 and Codon C 2284. Codon D 2286 and Codon E 2288 differ in the third nucleic acid position and will not transcribe and translate to the same amino acid. If a non-target reference genome contained Codon D 2286 and a pseudo-target reference genome contained Codon E 2288 at the same aligned position, these aligned codons would not match and called variants that align to the genomic region corresponding to Codon D 2286 and Codon E 2288 are filtered out.

FIG. 23 illustrates the process 2300 of filtering genes based on a distribution of machine learning scores. Scores from a variant quality classifier are plotted on a graph measuring frequency for both a Specific Gene 2304 and Exomewide 2302. A Wilcoxon rank sum test determines if the Specific Gene distribution 2304 is skewed in comparison to the Exomewide Distribution 2303 via significance testing for the probability of a randomly selected machine learning score from the Specific Gene Distribution 2304 being greater than a randomly selected machine learning score from the Exomewide Distribution 2302 is equivalent to the probability of a randomly selected machine learning score from the Exomewide Distribution 2302 being greater than a randomly selected machine learning score from the Specific Gene Distribution 2304. Called variants mapped to genes that are determined to be skewed in contrast to the Exomewide Distribution 2302 are filtered out. Determination of skewedness when comparing the Exomewide Distribution 2302 and the Specific Gene Distribution 2304 identifies the gene as an outlier with potential error.

FIG. 24 illustrates deviation from Hardy-Weinberg Equilibrium in an example population 2400. A filter within the Cascading Filters 2004 removes variants that deviate from the Hardy-Weinberg Equilibrium. Dominant alleles are represented by the letter ‘p’ and recessive alleles are represented by the letter ‘q’. Homozygous dominant genotypes (i.e., ‘pp’; 2402) are represented by upward diagonal shaded circles. Heterozygous genotypes (‘pq’; 2404) are represented by diamond crosshatched circles. Homozygous recessive genotypes (‘qq’; 2406) are represented by downward diagonal shaded circles. The population shown includes 25 samples with respective genotypes. In Generation One 2442, each genotype has respective frequencies counted as the proportion of the respective genotype to the total population count. In Generation Two 2444, each genotype has updated respective frequencies counted as the proportion of the respective genotype to the total population count. Populations with unchanged genotype frequencies in sequential generations are considered to be in Hardy-Weinberg Equilibrium. The genotype frequencies for the example population shown in FIG. 24 are different in Generation Two 2444 from Generation One 2442 therefore the population deviates from the Hardy-Weinberg Equilibrium. Deviations from the Hardy-Weinberg Equilibrium can result in overcalling of heterozygous genotypes and as a result, called variants mapped to genes that are not in Hardy-Weinberg Equilibrium as determined by large population databases are filtered out.

FIG. 25 is an illustration 2500 of a nonsense variant. A filter within the Cascading Filters 2004 removes nonsense variants. Nonsense variants, also referred to as ‘stop gain variants’, result from single nucleotide polymorphisms which change a codon sequence such that a previously amino acid-translating codon will translate to a stop codon as a result of the novel mutated amino acid sequence. Premature stop codons prevent the remainder of the mRNA transcript from being translated and as a result the amino acid sequence is terminated early. Genetic Sequence B 2502 is transcribed to mRNA Transcript B 2522 and mRNA Transcript B 2522 is translated into Amino Acid Sequence B 2542 for a total of five codons. Single Nucleotide Polymorphism 2540 at position 12 results in a change from a guanine nucleic acid to a thymine nucleic acid. As a result, the fourth codon has changed from ACG to ACT and will subsequently be transcribed to a stop codon rather than being transcribed and translated to a cysteine amino acid residue. The premature stop codon ends translation and the fifth codon will never be translated.

FIG. 26 contains a graph 2600 of collected results demonstrating the cascading filter effect on number of nonsense variants per sample. In one implementation of the technology disclosed, number of nonsense variants per sample is compared between samples from non-human primate species and human. No filtering of the called variants from samples from non-human primate species results in a significantly higher number of nonsense variants per sample as compared to the corresponding human level of nonsense variants per sample. The called variants from samples from non-human primate species undergo cascaded filters including a codon match filter, gene annotation error filter, machine learning distribution skew filter, Hardy-Weinberg Equilibrium deviation filter, Unique Mapper filter (called variants with Unique Mapper scores less than 0.6 removed), and random forest score filter (called variants with a random forest score greater than 0.17 removed). Boxplots showing the average number of stop-gained variants per sample of each primate reference species was gradually reduced to close to human level after a series of variant filtering steps, including requiring codon-match, removing SNPs in poorly-annotated genes or in genes with skewed random forest (RF) score distribution or deviating from Hardy Weinberg equilibrium, and removing SNPs with unique-mapper score <0.6 or RF score >0.17. Each dot represents the average number of stop-gained variants of each primate reference species. The horizontal line shows the average number of stop-gained variants of human samples from Platinum genome project.

FIG. 27 contains a graph 2700 of collected results demonstrating the cascading filter effect on missense: synonymous ratio of called variants per sample. In one implementation of the technology disclosed, missense: synonymous ratio (MSR; the ratio used to estimate the balance of benign and pathogenic variants present within a particular cohort) is compared between samples from non-human primate species and human. The called variants from samples from non-human primate species undergo cascaded filters including a codon match filter, gene annotation error filter, machine learning distribution skew filter, Hardy-Weinberg Equilibrium deviation filter, Unique Mapper filter (called variants with Unique Mapper scores less than 0.6 removed), and random forest score filter (called variants with a random forest score greater than 0.17 removed). Boxplots showing missense: synonymous ratios decreased after variant filtering steps. Each dot represents the MSR of each primate reference species. The black line represents MSR of human samples.

FIG. 28 contains a graph 2800 of collected results demonstrating the cascading filter effect on number of insertion-deletion variants (indels) per sample. The called variants from samples from non-human primates undergo cascading filters including a gene annotation error filter, machine learning distribution skew filter, Hardy-Weinberg Equilibrium deviation filter, and Unique Mapper filter (called variants with Unique Mapper scores less than 0.6 removed). The average number of indels per sample of each primate reference species diminished after filtering steps.

Computer System

FIG. 29 shows an example computer system 2900 that can be used to implement the technology disclosed. Computer system 2900 includes at least one central processing unit (CPU) 2972 that communicates with a number of peripheral devices via bus subsystem 2955. These peripheral devices can include a storage subsystem 2910 including, for example, memory devices and a file storage subsystem 2936, user interface input devices 2938, user interface output devices 2976, and a network interface subsystem 2974. The input and output devices allow user interaction with computer system 2900. Network interface subsystem 2974 provides an interface to outside networks, including an interface to corresponding interface devices in other computer systems.

In one implementation, the random forest model 1744 is communicably linked to the storage subsystem 2910 and the user interface input devices 2938.

User interface input devices 2938 can include a keyboard; pointing devices such as a mouse, trackball, touchpad, or graphics tablet; a scanner; a touch screen incorporated into the display; audio input devices such as voice recognition systems and microphones; and other types of input devices. In general, use of the term “input device” is intended to include all possible types of devices and ways to input information into computer system 2900.

User interface output devices 2976 can include a display subsystem, a printer, a fax machine, or non-visual displays such as audio output devices. The display subsystem can include an LED display, a cathode ray tube (CRT), a flat-panel device such as a liquid crystal display (LCD), a projection device, or some other mechanism for creating a visible image. The display subsystem can also provide a non-visual display such as audio output devices. In general, use of the term “output device” is intended to include all possible types of devices and ways to output information from computer system 2900 to the user or to another machine or computer system.

Storage subsystem 2910 stores programming and data constructs that provide the functionality of some or all of the modules and methods described herein. These software modules are generally executed by processors 2978.

Processors 2978 can be graphics processing units (GPUs), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), and/or coarse-grained reconfigurable architectures (CGRAs). Processors 2978 can be hosted by a deep learning cloud platform such as Google Cloud Platform™, Xilinx™, and Cirrascale™. Examples of processors 2978 include Google's Tensor Processing Unit (TPU)™, rackmount solutions like GX4 Rackmount Series™, GX29 Rackmount Series™, NVIDIA DGX-1™, Microsoft' Stratix V FPGA™, Graphcore's Intelligent Processor Unit (IPU)™, Qualcomm's Zeroth Platform™ with Snapdragon Processors™, NVIDIA's Volta™, NVIDIA's DRIVE PX™, NVIDIA's JETSON TX1/TX2 MODULE™, Intel's Nirvana™, Movidius VPU™, Fujitsu DPI™, ARM's DynamicIQ™, IBM TrueNorth™, Lambda GPU Server with Testa V100s™, and others.

Memory subsystem 2922 used in the storage subsystem 2910 can include a number of memories including a main random access memory (RAM) 2932 for storage of instructions and data during program execution and a read only memory (ROM) 2934 in which fixed instructions are stored. A file storage subsystem 2936 can provide persistent storage for program and data files, and can include a hard disk drive, a floppy disk drive along with associated removable media, a CD-ROM drive, an optical drive, or removable media cartridges. The modules implementing the functionality of certain implementations can be stored by file storage subsystem 2936 in the storage subsystem 2910, or in other machines accessible by the processor.

Bus subsystem 2955 provides a mechanism for letting the various components and subsystems of computer system 2900 communicate with each other as intended. Although bus subsystem 2955 is shown schematically as a single bus, alternative implementations of the bus subsystem can use multiple busses.

Computer system 2900 itself can be of varying types including a personal computer, a portable computer, a workstation, a computer terminal, a network computer, a television, a mainframe, a server farm, a widely-distributed set of loosely networked computers, or any other data processing system or user device. Due to the ever-changing nature of computers and networks, the description of computer system 2900 depicted in FIG. 29 is intended only as a specific example for purposes of illustrating the preferred implementations of the present invention. Many other configurations of computer system 2900 are possible having more or less components than the computer system depicted in FIG. 29 .

Clauses

The technology disclosed, in particularly, the clauses disclosed in this section, can be practiced as a system, method, or article of manufacture. One or more features of an implementation can be combined with the base implementation. Implementations that are not mutually exclusive are taught to be combinable. One or more features of an implementation can be combined with other implementations. This disclosure periodically reminds the user of these options. Omission from some implementations of recitations that repeat these options should not be taken as limiting the combinations taught in the preceding sections—these recitations are hereby incorporated forward by reference into each of the following implementations.

One or more implementations and clauses of the technology disclosed or elements thereof can be implemented in the form of a computer product, including a non-transitory computer readable storage medium with computer usable program code for performing the method steps indicated. Furthermore, one or more implementations and clauses of the technology disclosed or elements thereof can be implemented in the form of an apparatus including a memory and at least one processor that is coupled to the memory and operative to perform exemplary method steps. Yet further, in another aspect, one or more implementations and clauses of the technology disclosed or elements thereof can be implemented in the form of means for carrying out one or more of the method steps described herein; the means can include (i) hardware module(s), (ii) software module(s) executing on one or more hardware processors, or (iii) a combination of hardware and software modules; any of (i)-(iii) implement the specific techniques set forth herein, and the software modules are stored in a computer readable storage medium (or multiple such media).

The clauses described in this section can be combined as features. In the interest of conciseness, the combinations of features are not individually enumerated and are not repeated with each base set of features. The reader will understand how features identified in the clauses described in this section can readily be combined with sets of base features identified as implementations in other sections of this application. These clauses are not meant to be mutually exclusive, exhaustive, or restrictive; and the technology disclosed is not limited to these clauses but rather encompasses all possible combinations, modifications, and variations within the scope of the claimed technology and its equivalents.

Other implementations of the clauses described in this section can include a non-transitory computer readable storage medium storing instructions executable by a processor to perform any of the clauses described in this section. Yet another implementation of the clauses described in this section can include a system including memory and one or more processors operable to execute instructions, stored in the memory, to perform any of the clauses described in this section.

We disclose the following clauses:

1. A computer-implemented method of identifying and excluding regions that do not have one-to-one mapping between a first reference genome and a second reference genome, including:

accessing sequenced reads of a sample of a target species;

identifying and removing, from the sequenced reads, low-quality sequenced reads based on applying a mapping quality filter to the sequenced reads, thereby pruning high-quality sequenced reads from the sequenced reads;

segmenting a non-target reference genome of a non-target species into a plurality of bins, and then, on a bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the non-target reference genome;

segmenting a pseudo-target reference genome of a pseudo-target species into the plurality of bins, and then, on the bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the pseudo-target reference genome;

identifying a best-mapped bin in the pseudo-target reference genome based on a greatest degree of match between the best-mapped bin in the pseudo-target reference genome and a corresponding bin in the non-target reference genome, wherein a degree of match between corresponding bins in the pseudo-target reference genome and the non-target reference genome is determined by a number of reads mapped between the corresponding bins;

generating a unique-mapper score for the pseudo-target reference genome based on a number of reads mapped between the best-mapped bin in the pseudo-target reference genome and the corresponding bin in the non-target reference genome; and

using the unique-mapper score to identify and exclude low-quality sequenced reads.

2. The computer-implemented method of clause 1, wherein low-quality sequenced reads include stop-gained variants. 3. The computer-implemented method of clause 1, wherein a plurality of cascading filters the applied to the sequenced reads of the sample of the target species to filter low-quality sequenced reads. 4. The computer-implemented method of clause 3, wherein a filter within the plurality of cascading filters is configured to detect and exclude genetic regions possessing incorrect gene annotation in a reference genome. 5. The computer-implemented method of clause 3, wherein a filter within the plurality of cascading filters is configured to detect and exclude codons that do not match between the pseudo-target species reference genome and the non-target species reference genome. 6. The computer-implemented method of clause 3, wherein a filter within the plurality of cascading filters is configured to detect and exclude genes within a reference genome possessing a skewed distribution of variant classifier scores in comparison to a distribution of variant classifier scores for the complete reference genome. 7. The computer-implemented method of clause 3, wherein a filter within the plurality of cascading filters is configured to detect and exclude genes within a reference genome possessing deviations from the Hardy-Weinberg equilibrium. 8. The computer-implemented method of clause 3, wherein a filter within the plurality of cascading filters is configured to detect and remove single nucleotide polymorphisms with a random forest score of greater than 0.17. 9. The computer-implemented method of clause 1, wherein a one-to-one mapping describes the fraction of a number of reads in one bin within non-target reference genome map to a single corresponding region within a pseudo-target reference genome. 10. The computer-implemented method of clause 9, wherein consecutive identical bins are collectively considered as a single bin and do not exclude the possibility of a one-to-one mapping. 11. The computer-implemented method of clause 9, wherein more than two nonconsecutive identical bins are considered duplicate regions and exclude the possibility of a one-to-one mapping. 12. The computer-implemented method of clause 1, wherein a bin describes a one kilobase (kb) region within a reference genome. 13. The computer-implemented method of clause 1, wherein a fraction of reads mapped is detected for the best-mapped region as determined by the mapper score. 14. The computer-implemented method of clause 1, wherein the unique mapper score is determined by an average of a top fraction across samples for each reference genome. 15. The computer-implemented method of clause 1, wherein the unique mapper score is configured as a filter to exclude sequenced reads with a mapper score less than 20. 16. The computer-implemented method of clause 1, wherein the pseudo-target species is a human. 17. The computer-implemented method of clause 1, wherein the pseudo-target species is a non-human primate. 18. The computer-implemented method of clause 1, wherein the non-target species is a human. 19. The computer-implemented method of clause 1, wherein the non-target species is a non-human primate. 20. The computer-implemented method of clause 1, wherein the target species is a human. 21. The computer-implemented method of clause 1, wherein the target species is a non-human primate. 22. The computer-implemented method of clause 1, wherein the target species and non-target species are homologous. 23. The computer-implemented method of clause 1, wherein the target species and pseudo-target species are homologous. 24. The computer-implemented method of clause 1, wherein the quality of a variant identified from sequenced reads of a target species is a proxy for evolutionary constraint on the variant gene. 25. A system including one or more processors coupled to memory, the memory loaded with computer instructions to identify and exclude regions that do not have one-to-one mapping between a first reference genome and a second reference genome, the instructions, when executed on the processors, implement actions comprising:

accessing sequenced reads of a sample of a target species;

identifying and removing, from the sequenced reads, low-quality sequenced reads based on applying a mapping quality filter to the sequenced reads, thereby pruning high-quality sequenced reads from the sequenced reads;

segmenting a non-target reference genome of a non-target species into a plurality of bins, and then, on a bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the non-target reference genome;

segmenting a pseudo-target reference genome of a pseudo-target species into the plurality of bins, and then, on the bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the pseudo-target reference genome;

identifying a best-mapped bin in the pseudo-target reference genome based on a greatest degree of match between the best-mapped bin in the pseudo-target reference genome and a corresponding bin in the non-target reference genome, wherein a degree of match between corresponding bins in the pseudo-target reference genome and the non-target reference genome is determined by a number of reads mapped between the corresponding bins;

generating a unique-mapper score for the pseudo-target reference genome based on a number of reads mapped between the best-mapped bin in the pseudo-target reference genome and the corresponding bin in the non-target reference genome; and

using the unique-mapper score to identify and exclude low-quality sequenced reads. 26. The system of clause 25, wherein low-quality sequenced reads include stop-gained variants. 27. The system of clause 25, wherein a plurality of cascading filters the applied to the sequenced reads of the sample of the target species to filter low-quality sequenced reads. 28. The system of clause 27, wherein a filter within the plurality of cascading filters is configured to detect and exclude genetic regions possessing incorrect gene annotation in a reference genome. 29. The system of clause 27, wherein a filter within the plurality of cascading filters is configured to detect and exclude codons that do not match between the pseudo-target species reference genome and the non-target species reference genome. 30. The system of clause 27, wherein a filter within the plurality of cascading filters is configured to detect and exclude genes within a reference genome possessing a skewed distribution of variant classifier scores in comparison to a distribution of variant classifier scores for the complete reference genome. 31. The system of clause 27, wherein a filter within the plurality of cascading filters is configured to detect and exclude genes within a reference genome possessing deviations from the Hardy-Weinberg equilibrium. 32. The system of clause 27, wherein a filter within the plurality of cascading filters is configured to detect and remove single nucleotide polymorphisms with a random forest score of greater than 0.17. 33. The system of clause 25, wherein a one-to-one mapping describes the fraction of a number of reads in one bin within non-target reference genome map to a single corresponding region within a pseudo-target reference genome. 34. The system of clause 33, wherein consecutive identical bins are collectively considered as a single bin and do not exclude the possibility of a one-to-one mapping. 35. The system of clause 33, wherein more than two nonconsecutive identical bins are considered duplicate regions and exclude the possibility of a one-to-one mapping. 36. The system of clause 25, wherein a bin describes a one kilobase (kb) region within a reference genome. 37. The system of clause 25, wherein a fraction of reads mapped is detected for the best-mapped region as determined by the mapper score. 38. The system of clause 25, wherein the unique mapper score is determined by an average of a top fraction across samples for each reference genome. 39. The system of clause 25, wherein the unique mapper score is configured as a filter to exclude sequenced reads with a mapper score less than 20. 40. The system of clause 25, wherein the pseudo-target species is a human. 41. The system of clause 25, wherein the pseudo-target species is a non-human primate. 42. The system of clause 25, wherein the non-target species is a human. 43. The system of clause 25, wherein the non-target species is a non-human primate. 44. The system of clause 25, wherein the target species is a human. 45. The system of clause 25, wherein the target species is a non-human primate. 46. The system of clause 25, wherein the target species and non-target species are homologous. 47. The system of clause 25, wherein the target species and pseudo-target species are homologous. 48. The system of clause 25, wherein the quality of a variant identified from sequenced reads of a target species is a proxy for evolutionary constraint on the variant gene. 49. A non-transitory computer readable storage medium impressed with computer program instructions to identify and exclude regions that do not have one-to-one mapping between a first reference genome and a second reference genome, the instructions, when executed on a processor, implement a method comprising:

accessing sequenced reads of a sample of a target species;

identifying and removing, from the sequenced reads, low-quality sequenced reads based on applying a mapping quality filter to the sequenced reads, thereby pruning high-quality sequenced reads from the sequenced reads;

segmenting a non-target reference genome of a non-target species into a plurality of bins, and then, on a bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the non-target reference genome;

segmenting a pseudo-target reference genome of a pseudo-target species into the plurality of bins, and then, on the bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the pseudo-target reference genome;

identifying a best-mapped bin in the pseudo-target reference genome based on a greatest degree of match between the best-mapped bin in the pseudo-target reference genome and a corresponding bin in the non-target reference genome, wherein a degree of match between corresponding bins in the pseudo-target reference genome and the non-target reference genome is determined by a number of reads mapped between the corresponding bins;

generating a unique-mapper score for the pseudo-target reference genome based on a number of reads mapped between the best-mapped bin in the pseudo-target reference genome and the corresponding bin in the non-target reference genome; and

using the unique-mapper score to identify and exclude low-quality sequenced reads. 50. The non-transitory computer readable storage medium of clause 49, wherein low-quality sequenced reads include stop-gained variants. 51. The non-transitory computer readable storage medium of clause 49, wherein a plurality of cascading filters the applied to the sequenced reads of the sample of the target species to filter low-quality sequenced reads. 52. The non-transitory computer readable storage medium of clause 51, wherein a filter within the plurality of cascading filters is configured to detect and exclude genetic regions possessing incorrect gene annotation in a reference genome. 53. The non-transitory computer readable storage medium of clause 51, wherein a filter within the plurality of cascading filters is configured to detect and exclude codons that do not match between the pseudo-target species reference genome and the non-target species reference genome. 54. The non-transitory computer readable storage medium of clause 51, wherein a filter within the plurality of cascading filters is configured to detect and exclude genes within a reference genome possessing a skewed distribution of variant classifier scores in comparison to a distribution of variant classifier scores for the complete reference genome. 55. The non-transitory computer readable storage medium of clause 51, wherein a filter within the plurality of cascading filters is configured to detect and exclude genes within a reference genome possessing deviations from the Hardy-Weinberg equilibrium. 56. The non-transitory computer readable storage medium of clause 51, wherein a filter within the plurality of cascading filters is configured to detect and remove single nucleotide polymorphisms with a random forest score of greater than 0.17. 57. The non-transitory computer readable storage medium of clause 49, wherein a one-to-one mapping describes the fraction of a number of reads in one bin within non-target reference genome map to a single corresponding region within a pseudo-target reference genome. 58. The non-transitory computer readable storage medium of clause 57, wherein consecutive identical bins are collectively considered as a single bin and do not exclude the possibility of a one-to-one mapping. 59. The non-transitory computer readable storage medium of clause 57, wherein more than two nonconsecutive identical bins are considered duplicate regions and exclude the possibility of a one-to-one mapping. 60. The non-transitory computer readable storage medium of clause 49, wherein a bin describes a one kilobase (kb) region within a reference genome. 61. The non-transitory computer readable storage medium of clause 49, wherein a fraction of reads mapped is detected for the best-mapped region as determined by the mapper score. 62. The non-transitory computer readable storage medium of clause 49, wherein the unique mapper score is determined by an average of a top fraction across samples for each reference genome. 63. The non-transitory computer readable storage medium of clause 49, wherein the unique mapper score is configured as a filter to exclude sequenced reads with a mapper score less than 20. 64. The non-transitory computer readable storage medium of clause 49, wherein the pseudo-target species is a human. 65. The non-transitory computer readable storage medium of clause 49, wherein the pseudo-target species is a non-human primate. 66. The non-transitory computer readable storage medium of clause 49, wherein the non-target species is a human. 67. The non-transitory computer readable storage medium of clause 49, wherein the non-target species is a non-human primate. 68. The non-transitory computer readable storage medium of clause 49, wherein the target species is a human. 69. The non-transitory computer readable storage medium of clause 49, wherein the target species is a non-human primate. 70. The non-transitory computer readable storage medium of clause 49, wherein the target species and non-target species are homologous. 71. The non-transitory computer readable storage medium of clause 49, wherein the target species and pseudo-target species are homologous. 72. The non-transitory computer readable storage medium of clause 49, wherein the quality of a variant identified from sequenced reads of a target species is a proxy for evolutionary constraint on the variant gene. 

What we claim is:
 1. A computer-implemented method of identifying and excluding regions that do not have one-to-one mapping between a first reference genome and a second reference genome, including: accessing sequenced reads of a sample of a target species; identifying and removing, from the sequenced reads, low-quality sequenced reads based on applying a mapping quality filter to the sequenced reads, thereby pruning high-quality sequenced reads from the sequenced reads; segmenting a non-target reference genome of a non-target species into a plurality of bins, and then, on a bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the non-target reference genome; segmenting a pseudo-target reference genome of a pseudo-target species into the plurality of bins, and then, on the bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the pseudo-target reference genome; identifying a best-mapped bin in the pseudo-target reference genome based on a greatest degree of match between the best-mapped bin in the pseudo-target reference genome and a corresponding bin in the non-target reference genome, wherein a degree of match between corresponding bins in the pseudo-target reference genome and the non-target reference genome is determined by a number of reads mapped between the corresponding bins; generating a unique-mapper score for the pseudo-target reference genome based on a number of reads mapped between the best-mapped bin in the pseudo-target reference genome and the corresponding bin in the non-target reference genome; and using the unique-mapper score to identify and exclude low-quality sequenced reads.
 2. The computer-implemented method of claim 1, wherein low-quality sequenced reads include stop-gained variants.
 3. The computer-implemented method of claim 1, wherein a plurality of cascading filters the applied to the sequenced reads of the sample of the target species to filter low-quality sequenced reads.
 4. The computer-implemented method of claim 3, wherein a filter within the plurality of cascading filters is configured to detect and exclude genetic regions possessing incorrect gene annotation in a reference genome.
 5. The computer-implemented method of claim 3, wherein a filter within the plurality of cascading filters is configured to detect and exclude codons that do not match between the pseudo-target species reference genome and the non-target species reference genome.
 6. The computer-implemented method of claim 3, wherein a filter within the plurality of cascading filters is configured to detect and exclude genes within a reference genome possessing a skewed distribution of variant classifier scores in comparison to a distribution of variant classifier scores for a complete reference genome.
 7. The computer-implemented method of claim 3, wherein a filter within the plurality of cascading filters is configured to detect and exclude genes within a reference genome possessing deviations from a Hardy-Weinberg equilibrium.
 8. The computer-implemented method of claim 3, wherein a filter within the plurality of cascading filters is configured to detect and remove single nucleotide polymorphisms with a random forest score of greater than 0.17.
 9. The computer-implemented method of claim 1, wherein a one-to-one mapping describes a fraction of a number of reads in one bin within non-target reference genome map to a single corresponding region within a pseudo-target reference genome.
 10. The computer-implemented method of claim 9, wherein consecutive identical bins are collectively considered as a single bin and do not exclude a possibility of a one-to-one mapping.
 11. The computer-implemented method of claim 9, wherein more than two nonconsecutive identical bins are considered duplicate regions and exclude a possibility of a one-to-one mapping.
 12. The computer-implemented method of claim 1, wherein a bin describes a one kilobase (kb) region within a reference genome.
 13. The computer-implemented method of claim 1, wherein a fraction of reads mapped is detected for a best-mapped region as determined by the unique-mapper score.
 14. The computer-implemented method of claim 1, wherein the unique-mapper score is determined by an average of a top fraction across samples for each reference genome.
 15. The computer-implemented method of claim 1, wherein the unique-mapper score is configured as a filter to exclude sequenced reads with a mapper score less than
 20. 16. The computer-implemented method of claim 1, wherein the pseudo-target species is a human.
 17. The computer-implemented method of claim 1, wherein the pseudo-target species is a non-human primate.
 18. The computer-implemented method of claim 1, wherein the non-target species is a human.
 19. The computer-implemented method of claim 1, wherein the non-target species is a non-human primate.
 20. The computer-implemented method of claim 1, wherein the target species is a human.
 21. The computer-implemented method of claim 1, wherein the target species is a non-human primate.
 22. The computer-implemented method of claim 1, wherein the target species and non-target species are homologous.
 23. The computer-implemented method of claim 1, wherein the target species and pseudo-target species are homologous.
 24. The computer-implemented method of claim 1, wherein the quality of a variant identified from sequenced reads of a target species is a proxy for evolutionary constraint on a variant gene.
 25. A system including one or more processors coupled to memory, the memory loaded with computer instructions to identify and exclude regions that do not have one-to-one mapping between a first reference genome and a second reference genome, the instructions, when executed on the processors, implement actions comprising: accessing sequenced reads of a sample of a target species; identifying and removing, from the sequenced reads, low-quality sequenced reads based on applying a mapping quality filter to the sequenced reads, thereby pruning high-quality sequenced reads from the sequenced reads; segmenting a non-target reference genome of a non-target species into a plurality of bins, and then, on a bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the non-target reference genome; segmenting a pseudo-target reference genome of a pseudo-target species into the plurality of bins, and then, on the bin-by-bin basis, mapping the high-quality sequenced reads to the plurality of bins in the pseudo-target reference genome; identifying a best-mapped bin in the pseudo-target reference genome based on a greatest degree of match between the best-mapped bin in the pseudo-target reference genome and a corresponding bin in the non-target reference genome, wherein a degree of match between corresponding bins in the pseudo-target reference genome and the non-target reference genome is determined by a number of reads mapped between the corresponding bins; generating a unique-mapper score for the pseudo-target reference genome based on a number of reads mapped between the best-mapped bin in the pseudo-target reference genome and the corresponding bin in the non-target reference genome; and using the unique-mapper score to identify and exclude low-quality sequenced reads.
 26. The system of claim 25, wherein low-quality sequenced reads include stop-gained variants.
 27. The system of claim 25, wherein a plurality of cascading filters the applied to the sequenced reads of the sample of the target species to filter low-quality sequenced reads.
 28. The system of claim 27, wherein a filter within the plurality of cascading filters is configured to detect and exclude genetic regions possessing incorrect gene annotation in a reference genome.
 29. The system of claim 27, wherein a filter within the plurality of cascading filters is configured to detect and exclude codons that do not match between the pseudo-target species reference genome and the non-target species reference genome.
 30. The system of claim 27, wherein a filter within the plurality of cascading filters is configured to detect and exclude genes within a reference genome possessing a skewed distribution of variant classifier scores in comparison to a distribution of variant classifier scores for a complete reference genome. 